Focusing on the information redundancy and encoding instability of depth image for gesture feature extraction in complex environment, an improved gesture feature extraction algorithm for depth image based on curvature-LBP (Local Binary Pattern) was proposed. Firstly, the divided gesture depth data to the point cloud data was converted through the coordinate conversion. Secondly, surface fitting was fulfilled with the moving least square method. And then the Gaussian curvature was calculated to describe the characteristics of the 3D surface geometry more accurately. Finally, the improved LBP uniform model was applied to encode the Gaussian curvature data and form a feature vector. In the American Sign Language (ASL) database, the average recognition rate of the proposed algorithm reached 91.20%, which 18.5 percentage points and 13.7 percentage points higher than 3DLBP and gradient LBP. Simulation results show that the proposed algorithm can recognize the gestures with similar outline and different shape, and improve the precision of describing the internal details in gesture depth image.

Aiming at the problem of path coverage test data generation, a new test data generation method based on improved Fireworks Xxplosion Optimization (FXO) algorithm was proposed. First, key-point path method was used to represent the program paths, and the hard-covered paths were defined by the theoretical paths, easy-covered paths and infeasible paths; the easy-covered paths adjacent to the hard-covered paths and their testing data were recorded and used as part of the initial fireworks to improve convergence speed, and the remaining initial fireworks were created randomly. Then according to the individuals' fitness values, an adaptive blast radius was designed to improve convergence rate, and the thought of boundary value test was introduced to modify the border-crossing sparkles. Compared with other seven optimization algorithms that generate testing data, including fireworks explosion optimization with adaptive radius and heuristic information (NFEO), FEO, F-method, NF-method, etc, the simulation results show that the proposed algorithm has lower time complexity of calculating level, and better performance in convergence.

Irregular computing exists in large scale parallel application widely and the automatic parallelization on distributed memory is hardly to generate parallel code for irregular loops at compile-time. The communication code of the parallel code influences the correctness and the efficiency to the runout of the program. It could automatically generate useful communication code for a common class of irregular loops at compile-time by using the approach of partial communication redundancy, that needed analyzing the array redistribution graph of the program to maintain the producer-consumer relation of irregular array references. The approach searched the local definition set of the irregular array on each processor by computation decomposition and accessed expression of array references as the communication data set, then analyzed the communication strategies for such irregular loops and generated the corresponding communication code. The experimental results show the validity of the approach and the expectant speedup of test applications.

When the pipelining loop has a great number of iterations, or the size of its body is large, but the number of available threads is small, the workload between two synchronizations of a thread is so heavy, which produces pretty low degree of parallelism. The traditional trade-off approach based on loop tiling cannot handle the above situation. To solve this problem, a pipelining granularity decreasing approach based on loop tiling was proposed. The optimal pipelining granularity was obtained by building the cost model for pipelining loop and a pipelining granularity optimizing algorithm was implemented. By measuring the wavefront loops of Finite Difference Relaxation (FDR) and the representative loops of Finite Difference Time Domain (FDTD), the loops show better performance improvement by using the proposed algorithm than the traditional one.

Slope and aspect calculating is a basic function of Geographic Information System (GIS). However, due to the existence of rounding and truncation errors, it is difficult to obtain the oracles of the implementation. In order to provide test oracles, this paper applied metamorphic testing technique into the testing of slope and aspected calculating programs, and designed several metamorphic relations by analyzing the geometric and numerical features, algorithm of slope and aspect calculating programs. It also analyzed the applicable range of these metamorphic relations, and formed the metamorphic testing method of slope and aspect calculating programs that was proved useful based on mutant testing. Our researches can not only be used as references for alleviating the oracle problem of other kinds of programs in GIS, but also help to promote the development of metamorphic testing technique.